Compile-Time Based Performance Prediction

Program Optimization Based on Compile-Time Cache Performance Prediction

We present a novel, compile-time method for determining the cache performance of the loop nests in a program. The cache-miss rates are produced by applying the program's reference string of a loop nest, determined during compilation, to an architecturally parameterized cache simulator. The obtained cache-miss rates correlate well with the performance of the loop nests on actual target machines....

Parallel Processing Letters Program Optimization Based on Compile-time Cache Performance Prediction

We present a novel, compile-time method for determining the cache performance of the loop nests in a program. The cache hit-rates are produced by applying the reference string, determined during compilation, to an architecturally parameterized cache simu-lator. We also describe a heuristic that uses this method for compile-time optimization of loop ranges in iteration-space blocking. The result...

Compile-time performance prediction of HPF/Fortran 90D

Performance modeling of parallel systems with flexible precision

The spectrum of approaches to performance prediction of parallel systems ranges from low-cost, lowprecision compile-time methods to high-cost, highprecision methods with an equal variety of underlying modeling formalisms (e.g., task graphs, queueing networks, simulation languages) which are mutually incompatible. A performance prediction technique is described which uni es a number of existing ...

The PAMELA Approach to Performance Modeling of Paralleland

We present a new methodology for the performance prediction of imperative, explicit parallel programs running on shared-memory or distributed-memory (vector) machines. The methodology is based on an imperative, procedure-oriented program and machine speciication formalism called Pamela with an associated calculus which allows performance models to be reduced prior to subsequent simulation. The ...